name = '''
& rule
1 & 1 = 1
1 & 0 = 0
0 & 0 = 0
0 & 1 = 0

与(&) 的原理
101 & 1
=> 101 & 001

由上至下对齐之后完成 与(&) 操作

=> 101
&  001
------
   001

阅读上面信息，完成题目
输入：整数
输入：整数二进制形式最右位的值，也叫做 least significant bit 最低位

'''
print(name)
def right_most_bit_value(n):
    return ?

print('Accept' if right_most_bit_value(0) == 0 else 'Wrong Answer')
print('Accept' if right_most_bit_value(1) == 1 else 'Wrong Answer')
print('Accept' if right_most_bit_value(3) == 1 else 'Wrong Answer')
print('Accept' if right_most_bit_value(4) == 0 else 'Wrong Answer')
print('Accept' if right_most_bit_value(100) == 0 else 'Wrong Answer')
print('Accept' if right_most_bit_value(1000001) == 1 else 'Wrong Answer')
